Detecting multiple chiral centers in chiral molecules with high harmonic generation

Characterizing chiral is highly important for applications in the pharmaceutical industry, as well as in the study of dynamical chemical and biological systems. However, this task has remained challenging, especially due to the ongoing increasing complexity and size of the molecular structure of drugs and active compounds. In particular, large molecules with many active chiral centers are today ubiquitous, but remain difficult to structurally analyze due to their high number of stereoisomers. Here we theoretically explore the sensitivity of high harmonic generation (HHG) to the chiral of molecules with a varying number of active chiral centers. We find that HHG driven by bi-chromatic non-collinear lasers is a sensitive probe for the stereo-configuration of a chiral molecule. We first show through calculations (from benchmark chiral molecules with up to three chiral centers) that the HHG spectrum is imprinted with information about the handedness of each chiral center in the driven molecule. Next, we show that using both classical- and deep-learning-based reconstruction algorithms, the composition of an unknown mixture of stereoisomers can be reconstructed with high fidelity by a single-shot HHG measurement. Our work illustrates how the combination of non-linear optics and machine learning might open routes for ultra-sensitive sensing in chiral systems

Conditional association between melanism and personality in Israeli barn owls

Capsule Boldness defines the extent to which animals are willing to take risks in the presence of a predator. Late, but not early, in the breeding season, Israeli nestling Barn Owls displaying larger black feather spots were more docile, feigned death longer and had a lower breathing rate when handled than smaller-spotted nestlings. Larger-spotted breeding females were less docile if heavy but more more docile if light. The covariation between personality (boldness vs. timid) and melanin-based colouration is therefore conditional on environmental factors

Minority Becomes Majority in Social Networks

It is often observed that agents tend to imitate the behavior of their neighbors in a social network. This imitating behavior might lead to the strategic decision of adopting a public behavior that differs from what the agent believes is the right one and this can subvert the behavior of the population as a whole. In this paper, we consider the case in which agents express preferences over two alternatives and model social pressure with the majority dynamics: at each step an agent is selected and its preference is replaced by the majority of the preferences of her neighbors. In case of a tie, the agent does not change her current preference. A profile of the agents' preferences is stable if the preference of each agent coincides with the preference of at least half of the neighbors (thus, the system is in equilibrium). We ask whether there are network topologies that are robust to social pressure. That is, we ask if there are graphs in which the majority of preferences in an initial profile always coincides with the majority of the preference in all stable profiles reachable from that profile. We completely characterize the graphs with this robustness property by showing that this is possible only if the graph has no edge or is a clique or very close to a clique. In other words, except for this handful of graphs, every graph admits at least one initial profile of preferences in which the majority dynamics can subvert the initial majority. We also show that deciding whether a graph admits a minority that becomes majority is NP-hard when the minority size is at most 1/4-th of the social network size.Comment: To appear in WINE 201

Genetic screening for mutants with altered seminal root numbers in hexaploid wheat using a high-throughput root phenotyping platform

Roots are the main channel for water and nutrient uptake in plants. Optimization of root architecture provides a viable strategy to improve nutrient and water uptake efficiency and maintain crop productivity under water-limiting and nutrient-poor conditions. We know little, however, about the genetic control of root development in wheat, a crop supplying 20% of global calorie and protein intake. To improve our understanding of the genetic control of seminal root development in wheat, we conducted a high-throughput screen for variation in seminal root number using an exome-sequenced mutant population derived from the hexaploid wheat cultivar Cadenza. The screen identified seven independent mutants with homozygous and stably altered seminal root number phenotypes. One mutant, Cadenza0900, displays a recessive extra seminal root number phenotype, while six mutants (Cadenza0062, Cadenza0369, Cadenza0393, Cadenza0465, Cadenza0818 and Cadenza1273) show lower seminal root number phenotypes most likely originating from defects in the formation and activation of seminal root primordia. Segregation analysis in F2 populations suggest that the phenotype of Cadenza0900 is controlled by multiple loci whereas the Cadenza0062 phenotype fits a 3:1 mutant:wild-type segregation ratio characteristic of dominant single gene action. This work highlights the potential to use the sequenced wheat mutant population as a forward genetic resource to uncover novel variation in agronomic traits, such as seminal root architecture

Time-Symmetric Initial Data for Multi-Body Solutions in Three Dimensions

Time-symmetric initial data for two-body solutions in three dimensional anti-deSitter gravity are found. The spatial geometry has constant negative curvature and is constructed as a quotient of two-dimensional hyperbolic space. Apparent horizons correspond to closed geodesics. In an open universe, it is shown that two black holes cannot exist separately, but are necessarily enclosed by a third horizon. In a closed universe, two separate black holes can exist provided there is an additional image mass.Comment: 12 pages, harvmac macro, minor changes in wordin

How Long It Takes for an Ordinary Node with an Ordinary ID to Output?

In the context of distributed synchronous computing, processors perform in rounds, and the time-complexity of a distributed algorithm is classically defined as the number of rounds before all computing nodes have output. Hence, this complexity measure captures the running time of the slowest node(s). In this paper, we are interested in the running time of the ordinary nodes, to be compared with the running time of the slowest nodes. The node-averaged time-complexity of a distributed algorithm on a given instance is defined as the average, taken over every node of the instance, of the number of rounds before that node output. We compare the node-averaged time-complexity with the classical one in the standard LOCAL model for distributed network computing. We show that there can be an exponential gap between the node-averaged time-complexity and the classical time-complexity, as witnessed by, e.g., leader election. Our first main result is a positive one, stating that, in fact, the two time-complexities behave the same for a large class of problems on very sparse graphs. In particular, we show that, for LCL problems on cycles, the node-averaged time complexity is of the same order of magnitude as the slowest node time-complexity. In addition, in the LOCAL model, the time-complexity is computed as a worst case over all possible identity assignments to the nodes of the network. In this paper, we also investigate the ID-averaged time-complexity, when the number of rounds is averaged over all possible identity assignments. Our second main result is that the ID-averaged time-complexity is essentially the same as the expected time-complexity of randomized algorithms (where the expectation is taken over all possible random bits used by the nodes, and the number of rounds is measured for the worst-case identity assignment). Finally, we study the node-averaged ID-averaged time-complexity.Comment: (Submitted) Journal versio

Parameterized Inapproximability of Target Set Selection and Generalizations

In this paper, we consider the Target Set Selection problem: given a graph and a threshold value $thr(v)$ for any vertex $v$ of the graph, find a minimum size vertex-subset to "activate" s.t. all the vertices of the graph are activated at the end of the propagation process. A vertex $v$ is activated during the propagation process if at least $thr(v)$ of its neighbors are activated. This problem models several practical issues like faults in distributed networks or word-to-mouth recommendations in social networks. We show that for any functions $f$ and $\rho$ this problem cannot be approximated within a factor of $\rho(k)$ in $f(k) \cdot n^{O(1)}$ time, unless FPT = W[P], even for restricted thresholds (namely constant and majority thresholds). We also study the cardinality constraint maximization and minimization versions of the problem for which we prove similar hardness results

How Many Cooks Spoil the Soup?

In this work, we study the following basic question: "How much parallelism does a distributed task permit?" Our definition of parallelism (or symmetry) here is not in terms of speed, but in terms of identical roles that processes have at the same time in the execution. We initiate this study in population protocols, a very simple model that not only allows for a straightforward definition of what a role is, but also encloses the challenge of isolating the properties that are due to the protocol from those that are due to the adversary scheduler, who controls the interactions between the processes. We (i) give a partial characterization of the set of predicates on input assignments that can be stably computed with maximum symmetry, i.e., $\Theta(N_{min})$, where $N_{min}$ is the minimum multiplicity of a state in the initial configuration, and (ii) we turn our attention to the remaining predicates and prove a strong impossibility result for the parity predicate: the inherent symmetry of any protocol that stably computes it is upper bounded by a constant that depends on the size of the protocol.Comment: 19 page

Inflation and Holography in String Theory

The encoding of an inflating patch of space-time in terms of a dual theory is discussed. Following Bousso's interpretation of the holographic principle, we find that those are generically described not by states in the dual theory but by density matrices. We try to implement this idea on simple deformations of the AdS/CFT examples, and an argument is given as to why inflation is so elusive to string theory.Comment: 15 pages, LaTeX, 2 figures. Uses psbox.te